Linear Algebraic Groups and Countable Borel Equivalence Relations Scot Adams and Alexander S. Kechris

نویسنده

  • ALEXANDER S. KECHRIS
چکیده

This paper is a contribution to the study of Borel equivalence relations on standard Borel spaces (i.e., Polish spaces equipped with their Borel structure). In mathematics one often deals with problems of classification of objects up to some notion of equivalence by invariants. Frequently these objects can be viewed as elements of a standard Borel space X and the equivalence turns out to be a Borel equivalence relation E on X . A complete classification of X up to E consists of finding a set of invariants I and a map c : X → I such that xEy ⇔ c(x) = c(y). For this to be of any interest both I and c must be explicit or definable and as simple and concrete as possible. The theory of Borel equivalence relations studies the set-theoretic nature of possible invariants and develops a mathematical framework for measuring the complexity of such classification problems. In organizing this study, the following concept of reducibility is fundamental. Let E,F be equivalence relations on standard Borel spaces X,Y , resp. We say that E is Borel reducible to F , in symbols,

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Countable Borel equivalence relations, Borel reducibility, and orbit equivalence

ing from the proof given above for Gaboriau-Popa we obtain theorems such as: Theorem 2.10 Let (X, d) be a complete, separable metric space equipped with an atomless Borel probability measure μ. Suppose Γ acts ergodically by measure preserving transformations on (X,μ) and the action on (X, d) is expansive. Let (Et)0<t<1 be a collection of distinct countable Borel equivalence relations on X with:...

متن کامل

Some Applications of the Adams-kechris Technique

We analyze the technique used by Adams and Kechris (2000) to obtain their results about Borel reducibility of countable Borel equivalence relations. Using this technique, we show that every Σ1 equivalence relation is Borel reducible to the Borel bi-reducibility of countable Borel equivalence relations. We also apply the technique to two other classes of essentially uncountable Borel equivalence...

متن کامل

Means on Equivalence Relations

Suppose that X is a Polish space and E is a countable Borel equivalence relation on X. We show that if there is a Borel assignment of means to the equivalence classes of E, then E is smooth. We also show that if there is a Baire measurable assignment of means to the equivalence classes of E, then E is generically smooth.

متن کامل

How Many Turing Degrees are There ?

A Borel equivalence relation on a Polish space is countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in recursion theory are: recursive isomorphism, Turing equivalence, arithmetic equivalence, etc. There is a canonical hierarchy of complexity of countable Borel equivalence rel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999